On Modeling Argumentation as Distributed Constraint Satisfaction: Initial Results
نویسندگان
چکیده
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Argumentation-based negotiation, where agents provide explicit arguments or justifications for their proposals for resolving conflicts, is an effective approach to resolve conflicts. However, while small-scale argumentation systems have been developed, a well-understood computational model of argumentation is missing. The lack of such a computational model makes it difficult to investigate properties of argumentation, such as convergence and scalability, and to understand and characterize different collaborative negotiation strategies in a principled manner. To alleviate these difficulties, we adopt distributed constraint satisfaction problem (DCSP) as a computational model for investigating conflict resolution via argumentation. We model argumentation as constraint propagation in DCSP. We study convergence properties of argumentation, and formulate and experimentally compare 16 different negotiation strategies with different levels of agent cooperativeness towards others. One surprising result from our experiments is that maximizing cooperativeness is not necessarily the best strategy even in a completely cooperative environment. The results appear to have bearing not only on multi-agent argumentation, but also on general DCSP systems as well. 1
منابع مشابه
Towards Large-Scale Conflict Resolution: Initial Results
With the increasing interest in distributed and collaborative multi-agent applications, conflict resolution in largescale systems becomes an important problem. Our approach to collaborative conflict resolution is based on argumentation. To understand the feasibility and the scope of the approach, we first implemented the process in a system called CONSA and applied it to two complex, dynamic do...
متن کاملArgumentation as Distributed Constraint Satisfaction: Applications and Results
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or justifications for their proposals for resolving conflicts, is an effective approach to resolve conflicts. Indeed, we are applying argumentation in some realworld multi-agent applications. However, a key problem in such a...
متن کاملDistributed Constraint Satisfaction as a Computational Model of Negotiation via Argumentation
متن کامل
A matrix approach for computing extensions of argumentation frameworks
The matrices and their sub-blocks are introduced into the study of determining various extensions in the sense of Dung's theory of argumentation frameworks. It is showed that each argumentation framework has its matrix representations, and the core semantics defined by Dung can be characterized by specific sub-blocks of the matrix. Furthermore, the elementary permutations of a matrix are employ...
متن کاملArgumentation Extensions Enumeration as a Constraint Satisfaction Problem: a Performance Overview
Enumerating semantics extensions in abstract argumentation is generally an intractable problem. For preferred semantics four implementations have been recently proposed, CONArg2, AspartixM, PrefSATand NAD-Alg, with significant runtime variations. This work is a first empirical evaluation of the performance of these implementations with the hypothesis that NAD-Alg, as representative of a family ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000